Fault-Tolerant Probabilistic Gradient-Descent Bit Flipping Decoder
نویسندگان
چکیده
منابع مشابه
Probabilistic Multileave Gradient Descent
Online learning to rank methods aim to optimize ranking models based on user interactions. The dueling bandit gradient descent (DBGD) algorithm is able to effectively optimize linear ranking models solely from user interactions. We propose an extension of DBGD, called probabilistic multileave gradient descent (PMGD) that builds on probabilistic multileave, a recently proposed highly sensitive a...
متن کاملDecoding LDPC codes via Noisy Gradient Descent Bit-Flipping with Re-Decoding
In this paper, we consider the performance of the Noisy Gradient Descent Bit Flipping (NGDBF) algorithm under re-decoding of failed frames. NGDBF is a recent algorithm that uses a non-deterministic gradient descent search to decode lowdensity parity check (LDPC) codes. The proposed re-decode procedure obtains improved performance because the perturbations are independent at each re-decoding pha...
متن کاملFault tolerant nano-memory with fault secure encoder and decoder
We introduce a nanowire-based, sublithographic memory architecture tolerant to transient faults. Both the storage elements and the supporting ECC encoder and corrector are implemented in dense, but potentially unreliable, nanowirebased technology. This compactness is made possible by a recently introduced Fault-Secure detector design [18]. Using Euclidean Geometry error-correcting codes (ECC), ...
متن کاملDesign and Synthesis of Fault Tolerant Decoder Using Reversible Logic
A binary decoder is a combinational logic circuit that converts a binary integer value to an associated pattern of output bits. They are used in a wide variety of applications, including data de-multiplexing, seven segment displays, and memory address decoding. This paper demonstrates the reversible logic synthesis for the n-to-2 n decoder, where n is the number of data bits. The circuits are d...
متن کاملFault-tolerant renormalization group decoder for abelian topological codes
We present a three-dimensional generalization of a renormalization group decoding algorithm for topological codes with Abelian anyonic excitations that we introduced for two dimensions in [1, 2]. This 3D implementation extends our previous 2D algorithm by incorporating a failure probability of the syndrome measurements, i.e., it enables fault-tolerant decoding. We report a fault-tolerant storag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2014
ISSN: 1089-7798
DOI: 10.1109/lcomm.2014.2344031